Blind Deconvolution of Bar Code Signals

نویسنده

  • Selim Esedoglu
چکیده

Abstract Bar code reconstruction involves recovering a clean signal from an observed one that is corrupted by convolution with a kernel and additive noise. The precise form of the convolution kernel is also unknown, making reconstruction harder than in the case of standard deblurring. On the other hand, bar codes are functions that have a very special form – this makes reconstruction feasible. We develop and analyze a total variation based variational model for the solution of this problem. This new technique models systematically the interaction of neighboring bars in the bar code under convolution with a kernel, as well as the estimation of the unknown parameters of the kernel from global information contained in the observed signal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robust Method for Blind Deconvolution of Barcode Signals and Nonuniform Illumination Estimation

This paper deals with a joint nonuniform illumination estimation and blind deconvolution for barcode signals. Such optimization problems are highly non convex. A robust method is needed in case of noisy and/or blurred signals and nonuniform illumination. Here, we present a novel method based on a genetic algorithm combining discrete and continuous optimization which is successfully applied to d...

متن کامل

Fundamental Limits of Blind Deconvolution Part II: Sparsity-Ambiguity Trade-offs

Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing. This problem is generally ill-posed since signal identifiability is a key concern, and there have been efforts to use sparse models for regularizing blind deconvolution to promote signal identifiability. Part I of this two-part paper establishes a measure theoretica...

متن کامل

Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms

In this paper we present a powerful technique for the blind extraction of Direct-Sequence Code-Division Multiple Access (DS-CDMA) signals from convolutive mixtures received by an antenna array. The technique is based on a generalization of the Canonical or Parallel Factor Decomposition (CANDECOMP/PARAFAC) in multilinear algebra. We present a bound on the number of users under which blind separa...

متن کامل

Recognition of the stacked two-dimensional bar code based on iterative deconvolution

Traditionally, the method of bar code recognition is based on edge detection. Because of the high density of the stacked two-dimensional bar code, the signal is severely blurred by the point spread function of the optical system. And this method is not suitable. In order to deblur the image, a deconvolution technique is necessary. Under the influence of noise, deconvolution is a type of ill-pos...

متن کامل

Improved Multi-Channel Blind De-Convolution Algorithm for Linear Convolved Mixture DS/CDMA Signals

—In this paper, an improved multi-channel blind deconvolution algorithm for code division multiple access signals is proposed. Through minimizing the average squared crossoutput-channel-correlation, the proposed scheme achieves a better source separation performance for the linear convolved mixture system. Unlike most of the existing linear convolved mixture separation algorithms in the litera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003